Sampling diffusive transition paths.
نویسندگان
چکیده
The authors address the problem of sampling double-ended diffusive paths. The ensemble of paths is expressed using a symmetric version of the Onsager-Machlup formula, which only requires evaluation of the force field and which, upon direct time discretization, gives rise to a symmetric integrator that is accurate to second order. Efficiently sampling this ensemble requires avoiding the well-known stiffness problem associated with the sampling of infinitesimal Brownian increments of the path, as well as a different type of stiffness associated with the sampling of the coarse features of long paths. The fine-feature sampling stiffness is eliminated with the use of the fast sampling algorithm, and the coarse-feature sampling stiffness is avoided by introducing the sliding and sampling (S&S) algorithm. A key feature of the S&S algorithm is that it enables massively parallel computers to sample diffusive trajectories that are long in time. The authors use the algorithm to sample the transition path ensemble for the structural interconversion of the 38-atom Lennard-Jones cluster at low temperature.
منابع مشابه
Stochastic actions for diffusive dynamics: reweighting, sampling, and minimization.
In numerical studies of diffusive dynamics, two different action functionals are often used to specify the probability distribution of trajectories, one of which requires the evaluation of the second derivative of the potential in addition to the force. Here it is argued that both actions are equivalent prescriptions for the purposes of reweighting and sampling trajectories, whereas the most pr...
متن کاملTransition paths, diffusive processes, and preequilibria of protein folding.
Fundamental relationships between the thermodynamics and kinetics of protein folding were investigated using chain models of natural proteins with diverse folding rates by extensive comparisons between the distribution of conformations in thermodynamic equilibrium and the distribution of conformations sampled along folding trajectories. Consistent with theory and single-molecule experiment, dur...
متن کاملStructure-guided Protein Transition Modeling with a Probabilistic Roadmap Algorithm.
Proteins are macromolecules in perpetual motion, switching between structural states to modulate their function. A detailed characterization of the precise yet complex relationship between protein structure, dynamics, and function requires elucidating transitions between functionally-relevant states. Doing so challenges both wet and dry laboratories, as protein dynamics involves disparate tempo...
متن کاملEfficient transition path sampling: Application to Lennard-Jones cluster rearrangements
We develop an efficient Monte-Carlo algorithm to sample an ensemble of stochastic transition paths between stable states. In our description, paths are represented by chains of states linked by Markovian transition probabilities. Rate constants and mechanisms characterizing the transition may be determined from the path ensemble. We have previously devised several algorithms for sampling the pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The Journal of chemical physics
دوره 126 14 شماره
صفحات -
تاریخ انتشار 2007